Determining the Viability of an Unbounded Polyhedron for a Switched System

نویسندگان

چکیده

This paper proposes a new method to determine the viability of switched system on cone and an unbounded polyhedron. First, we investigate condition cone. Then, sufficient criterion for polyhedron, which is expressed by convex hull finite number extreme points nonnegative linear combination directions, presented using nonsmooth analysis. Based this criterion, instead all boundary points, just several directions are needed be verified whether satisfying some conditions. The advantage proposed methods that determining easy implemented. Finally, example listed illustrate effectiveness methods.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Algorithms for the Frame of a Finitely Generated Unbounded Polyhedron

Consider two finite sets, A and V, of points in m-dimensional space. The convex hull of A and the conical hull of V can be combined to create a finitely generated unbounded polyhedron. We explore the geometry of these polyhedral sets to design, implement, test, and compare two different algorithms for finding the frame, a minimal cardinality subset of A and V, that generate the same polyhedron....

متن کامل

Computing the bounded subcomplex of an unbounded polyhedron

We study efficient combinatorial algorithms to produce the Hasse diagram of the poset of bounded faces of an unbounded polyhedron, given vertex-facet incidences. We also discuss the special case of simple polyhedra and present computational results.

متن کامل

investigating the feasibility of a proposed model for geometric design of deployable arch structures

deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...

A Simplicial Algorithm for the Nonlinear Stationary Point Problem on an Unbounded Polyhedron

A path following algorithm is proposed for finding a solution to the nonlinear stationary point problem on an unbounded, convex and pointed polyhedron. The algorithm can start at an arbitrary point of the polyhedron. The path to be foliowed by the algorithm is described as the path of zeros of some piecewise continuously differentiable function defined on an appropriate subdivided manifold. Thi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Dynamics in Nature and Society

سال: 2023

ISSN: ['1607-887X', '1026-0226']

DOI: https://doi.org/10.1155/2023/1153483